#include "SortingProvider.h"

void SortingProvider::InsertionSort(int arr[], int n)
{
    for(int i=1; i<n-1; i++)
    {
        int temp = arr[i];
        int j = i;
        while ( ( temp > arr[j] ) && ( j >= 0 ) )
        {
            arr[j] = arr[j-1];
            j--;
        }
        arr[j] = temp;
    }
}
